By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Volume 11, Issue 4, pp. 611-791

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Predicting the Number of Distinct Elements in a Multiset

Kohei Noshita

pp. 611-619

On Linear Characterizations of Combinatorial Optimization Problems

Richard M. Karp and Christos H. Papadimitriou

pp. 620-632

Evaluation of Arithmetic Expressions with Algebraic Identities

Teofilo Gonzalez and Joseph Ja'Ja'

pp. 633-662

An Approximation Algorithm for the Maximum Independent Set Problem on Planar Graphs

Norishige Chiba, Takao Nishizeki, and Nobuji Saito

pp. 663-675

Hamilton Paths in Grid Graphs

Alon Itai, Christos H. Papadimitriou, and Jayme Luiz Szwarcfiter

pp. 676-686

Algorithms for the Solution of Systems of Linear Diophantine Equations

Tsu-Wu J. Chou and George E. Collins

pp. 687-708

Scheduling the Open Shop to Minimize Mean Flow Time

James O. Achugbue and Francis Y. Chin

pp. 709-720

On Constructing Minimum Spanning Trees in $k$-Dimensional Spaces and Related Problems

Andrew Chi-Chih Yao

pp. 721-736

Some Area-Time Tradeoffs for VLSI

Richard P. Brent and Leslie M. Goldschlager

pp. 737-747

A Partial Analysis of Height-Balanced Trees under Random Insertions and Deletions

Kurt Mehlhorn

pp. 748-760

The Category-Theoretic Solution of Recursive Domain Equations

M. B. Smyth and G. D. Plotkin

pp. 761-783

Optimization of Cost and Delay in Cellular Permutation Networks

C. Ronse

pp. 784-788

On a Primality Test of Solovay and Strassen

A. O. L. Atkin and R. G. Larson

pp. 789-791